Systematic scan for sampling colorings
نویسندگان
چکیده
منابع مشابه
Vigoda’s Improvement On Sampling Colorings
In 1995, Jerrum proved a rapid mixing property on a certain Markov chain to solve the problem of sampling uniformly at random from the set of all proper k-colorings on a graph with maximum degree ∆. Jerrum’s proof was for the colorings for which k > 2∆. In 1999, Vigoda improved this bound to k > 11 6 ∆. There has been no improvement for this problem after that for general graphs. Here, we intro...
متن کاملSampling Random Colorings of Sparse Random Graphs
We study the mixing properties of the single-site Markov chain known as the Glauber dynam-ics for sampling k-colorings of a sparse random graph G(n, d/n) for constant d. The best knownrapid mixing results for general graphs are in terms of the maximum degree ∆ of the input graphG and hold when k > 11∆/6 for all G. Improved results hold when k > α∆ for graphs withgirth ≥ 5 and ∆ ...
متن کاملOn Sampling Colorings of Bipartite Graphs
We study the problem of efficiently sampling k-colorings of bipartite graphs. We show that a class of markov chains cannot be used as efficient samplers. Precisely, we show that, for any k, 6 ≤ k ≤ n1/3− , > 0 fixed, almost every bipartite graph on n + n vertices is such that the mixing time of any ergodic markov chain asymptotically uniform on its k-colorings is exponential in n/k (if it is al...
متن کاملA Non-Markovian Coupling for Randomly Sampling Colorings
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We prove the Glauber dynamics is close to the uniform distribution after O(n log n) steps whenever k > (1 + )∆, for all > 0, assuming g ≥ 11 and ∆ = Ω(log n). The best previously known bounds were k > 11∆/6 for general gra...
متن کاملOn Systematic Scan
In this thesis we study the mixing time of systematic scan Markov chains on finite spin systems. A systematic scan Markov chain is a Markov chain which updates the sites in a deterministic order and this type of Markov chain is often seen as intuitively appealing in terms of implementation to scientists conducting experimental work. Until recently systematic scan Markov chains have largely resi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2006
ISSN: 1050-5164
DOI: 10.1214/105051605000000683